Diclib.com
Dictionnaire ChatGPT

Recherche dans le dictionnaire Solutions personnalisées

Entrez un mot ou une phrase dans n'importe quelle langue 👆

Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

comment le mot est utilisé
fréquence d'utilisation
il est utilisé plus souvent dans le discours oral ou écrit
options de traduction de mots
exemples d'utilisation (plusieurs phrases avec traduction)
étymologie

Qu'est-ce (qui) est boolean search - définition

TECHNIQUES FOR SEARCHING A SINGLE COMPUTER-STORED DOCUMENT OR A COLLECTION IN A FULL TEXT DATABASE

Full Text Search; Free text search; Free text searching; Boolean search; Full text search; Freetext; Free-text; Full-Text Search; Fulltext search; Fulltext; Full-text; Full text; Full-text searching; Boolean search operator

Boolean search

<information science> (Or "Boolean query") A query using the Boolean operators, AND, OR, and NOT, and parentheses to construct a complex condition from simpler criteria. A typical example is searching for combinatons of keywords on a World-Wide Web search engine. Examples: car or automobile "New York" and not "New York state" The term is sometimes stretched to include searches using other operators, e.g. "near". Not to be confused with binary search. See also: weighted search. (1999-10-23)

Full-text search

In text retrieval, full-text search refers to techniques for searching a single computer-stored document or a collection in a full-text database. Full-text search is distinguished from searches based on metadata or on parts of the original texts represented in databases (such as titles, abstracts, selected sections, or bibliographical references).

https://en.wikipedia.org/wiki/Full-text_search

Boolean algebra (structure)

COMPLEMENTED DISTRIBUTIVE LATTICE

Boolean lattice; Boolean homomorphism; Boolean algebras; Generalized Boolean algebra; Generalized Boolean lattice; Generalized Boolean semilattice; Boolean algebra (history); Degenerate Boolean algebra; Axiomatization of Boolean algebras; Boolean hypercube

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations.

https://en.wikipedia.org/wiki/Boolean_algebra_(structure)

Wikipédia

Full-text search

In text retrieval, full-text search refers to techniques for searching a single computer-stored document or a collection in a full-text database. Full-text search is distinguished from searches based on metadata or on parts of the original texts represented in databases (such as titles, abstracts, selected sections, or bibliographical references).

In a full-text search, a search engine examines all of the words in every stored document as it tries to match search criteria (for example, text specified by a user). Full-text-searching techniques became common in online bibliographic databases in the 1990s. Many websites and application programs (such as word processing software) provide full-text-search capabilities. Some web search engines, such as AltaVista, employ full-text-search techniques, while others index only a portion of the web pages examined by their indexing systems.

https://en.wikipedia.org/wiki/Full-text search